The Semantic Space%2DTime Models of the Streamonas Data Stream Management System.

Architectural Principles of the %22Streamonas%22 Data Stream Management System and Performance Evaluation Based on the Linear Road Benchmark.

Solving the Problem of Trans%2DGenomic Query with Alignment Tables.

Lightweight Model Bases and Table%2DDriven Modeling.

Finding Minimal Sets of Informative Genes in Microarray Data.

Map%2Dreduce%2Dmerge simplified relational data processing on large clusters.

The GOBASE an information management system for Gene Ontology.

The GOBASE an information management system for Gene Ontology.

The Holodex Integrating Summarization with the Index.

Support for BioIndexing in BLASTgres.

Table%2DDriven Programming in SQL for Enterprise Information Systems.

Data cleaning using belief propagation.

Improving Mining Quality by Exploiting Data Dependency.


Perturbing and evaluating numerical programs without recompilation %2D the wonglediff way.


Empirical comparisons of various voting methods in bagging.

Evolving from Bioinformatics in%2Dthe%2DSmall to Bioinformatics in%2Dthe%2DLarge.
Motivation: A recurrent criticism is that certain bioinformatics tools do not account for crucial biology and therefore fail answering the targeted biological question. We posit that the single most important reason for such shortcomings is an inaccurate formulation of the computational problem. Results: Our paper describes how to define a bioinformatics problem so that it captures both the underlying biology and the computational constraints for a particular problem. The proposed model delineates comprehensively the biological problem and conducts an item-by-item bioinformatics transformation resulting in a germane computational problem. This methodology not only facilitates interdisciplinary information flow but also accommodates emerging knowledge and technologies.
Pyramidal Digest An Efficient Model for Abstracting Text Databases.

Landmarks a New Model for Similarity%2Dbased Pattern Querying in Time Series Databases.
In this paper we present the Landmark Model, a model for time series that yields new techniques for similarity-based time series pattern querying. The Landmark Model does not follow traditional similarity models that rely on pointwise Euclidean distance. Instead, it leads to Landmark Similarity, a general model of similarity that is consistent with human intuition and episodic memory. By tracking different specific subsets of features of landmarks, we can efficiently compute different Landmark Similarity measures that are invariant under corresponding subsets of six transformations; namely, Shifting, Uniform
Temporal Coupling Verification in Time Series Databases.

SQL%2FLPP A Time Series Extension of SQL Based on Limited Patience Patterns.

SQL%2FLPP A Time Series Extension of SQL Based on Limited Patience Patterns.

SQL%2FLPP  A Cascading Query Language for Temporal Correlation Verification.

Using randomization to make recursive matrix algorithms practical.

The Construction of Huffman Codes is a Submodular %28%22Convex%22%29 Optimization Problem Over a Lattice of Binary Trees.
We show that the space of all binary Huffman codes for a finite alphabet defines a lattice,  ordered by the imbalance of the code trees. Representing code trees as path-length sequences, we show that the imbalance ordering is closely related to a majorization ordering on realvalued sequences that correspond to discrete probability density functions. Furthermore, this tree imbalance is a partial ordering that is consistent with the total orderings given by either the external path length (sum of tree path lengths), or the entropy determined by the tree structure. On the imbalance lattice, we show the weighted path-length of a tree (the usual objective function for Huffman coding) is a submodular function, as is the corresponding function on the majorization lattice. Submodular functions are discrete analogues of convex functions. These results give perspective on Huffman coding, and suggest new approaches to coding as optimization over a lattice. 1 Introduction  Traditionally, the Huffm...
TDDA
this paper, we give a case history illustrating the real world application of a useful technique for data mining in text databases. The technique, Term Domain Distribution Analysis (TDDA), consists of keeping track of term frequencies for specific finite domains, and announcing significant differences from standard frequency distributions over these domains as a hypothesis. In the case study presented, the domain of terms was the pair f right; left g, over which we expected a uniform distribution. In analyzing term frequencies in a thoracic lung cancer database, the TDDA technique led to the surprising discovery that primary thoracic lung cancer tumors appear in the right lung more often than the left lung, with a ratio of 3:2. Treating the text discovery as a hypothesis, we verified this relationship against the medical literature in which primary lung tumor sites were reported, using a standard Ø
Knowledge Discovery in an Earthquake Text Database Correlation between Significant Earthquakes and the Time of Day.
In this paper, we take a real world application from a text database and present a case history. The techniques ultimately led to a discovery contradicting an accepted paradigm in seismology. Using simple, tailored, keyword extraction, we examined a text collection of earthquake data. A discovery was made when an unusual pattern emerged from the text. We then tested a more comprehensive numerical database, treating the the text discovery as a hypothesis. It was verified using a standard Ø  2  statistic. The hypothesis was significant earthquakes in the longitude regions that include California, occur more often in the morning hours than any other time of day. 1. Introduction  We are just beginning to see the emergence of textbased knowledge discovery systems [6, 12, 14] while the Information Retrieval (IR) community has been tackling the same routing and querying issues for more than 30 years [7, 23, 22]. The best retrieval and routing techniques do a respectable job at ranking relevan...
The Dance Party Problem and its Application to Collective Communication in Computer Networks.
Motivated by implementing collective communication operations on a network of processors connected via ethernet and similar bus lines, a problem of scheduling a dance party is formulated. The problem is solved by two algorithms based on searching and divide-and-conquer that generate suboptimal schedules and an algorithm based on graph factorization that generates optimal schedules. It is shown how to use dance schedules to implement collective communication operations such as all-gather.
Aesthetics%2DBased Graph Layout for Human Consumption.
OF THE THESIS Aesthetics-based Graph Layout for Human Consumption by Michael Karl Coleman Master of Science in Computer Science University of California, Los Angeles, 1993 Professor D. Stott Parker, Chair Automatic graph layout is an important and long-studied problem in computer science. The basic straight-edge graph layout problem is: Given a graph, position the vertices in a way which maximizes some measure of desirability. When graph layout is intended for human consumption, we call this measure of desirability an  aesthetic. We seek an algorithm which produces graph layouts of high aesthetic quality, and which handles trees, directed acyclic graphs, and general graphs. Our approach is to model graph layout as a multiobjective optimization problem, where the value of a layout is determined by a user-controlled set of layout aesthetics. We justify this model theoretically, and describe our Aesthetic Graph Layout (AGLO) algorithm and its implementation, the aglo library. The AGLO alg...
Improving SQL with Generalized Quantifiers.

A Method for Implementing Equational Theories as Logic Programs.
Equational theories underly many fields of computing, including functional programming, symbolic  algebra, theorem proving, term rewriting and constraint solving. In this paper we show a method  for implementing many equational theories with a limited class of logic programs. We define regular  equational theories, a useful class of theories, and illustrate with a number of examples how our method  can be used in obtaining efficient implementations for them.  The significance of our method is that:  ffl It is simple and easy to apply.  ffl Although executable, it supports separation of concerns between specification and implementation.  ffl Its class of logic programs execute with impressive efficiency using Prolog.  ffl It permits interesting compilation and optimization techniques that can improve execution efficiency  still further.  ffl It offers perspectives on term rewriting and functional programming evaluation strategies, how they  can be compiled, and how they can be integrate...
File Systems in User Space.


SVP A Model Capturing Sets%2C Lists%2C Streams%2C and Parallelism.


Mockingbird A Logical Methodology for Testing.

Regulation Management and Logic Programming.

Integrating AI and DBMS through Stream Processing.

The Tangram Stream Query Processing System.
In this overview paper we motivate the need for and research issues arising from a new model of data processing. In this model, data does not take the form of persistent relations, but rather arrives in multiple, continuous, rapid, time-varying data streams. In addition to reviewing past work relevant to data stream systems and current projects in the area, the paper explores topics in stream query languages, new requirements and challenges in query processing, and algorithmic issues. 1
Narrowing Grammars.

Partial Order Programming.
This paper shows the use of partial-order program clauses and lattice domains for declarative programming. This paradigm is particularly useful for expressing concise solutions to problems from graph theory, program analysis, and database querying. These applications are characterized by a need to solve circular constraints and perform aggregate operations, a capability that is very clearly and efficiently provided by partial-order clauses. We present a novel approach to their declarative and operational semantics, as well as the correctness of the operational semantics. The declarative semantics is model-theoretic in nature, but the least model for any function is not the classical intersection of all models, but the greatest lower bound/least upper bound of the respective terms defined for this function in the different models. The operational semantics combines top-down goal reduction with memo-tables. In the partial-order programming framework, however, memoization is primarily nee...
A Theory of Directed Logic Programs and Streams.

Formal Properties of Net%2DBased Knowledge Representation Schemes.

Set Containment Inference and Syllogisms.

Algorithms for Set Containment Inference.

Correction to %60%60An equivalence between relational database dependencies and a fragment of propositional logic%27%27.

Formal Properties of Net%2DBased Knowledge Representation Schemes.

Set Containment Inference.
This paper presents a new method for specifying and analyzing cryptographic protocols. Our method offers several advantages over previous approaches. Our technique is the first to allow reasoning about nonmonotonic protocols. These protocols are needed for systems that rely on the deletion of information. There is no idealization step in specifying protocols; we specify at a level that is close to the actual implementation. This avoids errors that might otherwise render a specification that passes the analysis, useless in practice. In our method, knowledge and belief sets for each principal are modified via actions and inference rules. Every message is considered to be broadcast, and we introduce the update function to maintain global knowledge. We show how our method uncovers the known flaw in the Needham and Schroeder protocol [11], and that the revision by the same authors [12] does not contain this flaw. We also show that our method correctly handles protocols that are trivially in...
Knowledge%2DBases and Database Engineering.

Logic Programming and Databases.
: We propose an extension of classical predicate calculus, called  Transaction Logic, which provides a logical foundation for the phenomenon of state changes in logic programs and databases. Transaction Logic comes with a natural model theory and a sound and complete proof theory. The proof theory not only verifies programs, but also executes them, which makes this logic an ideal tool for declarative programming of database transactions and state-modifying logic programs. The semantics of Transaction Logic leads naturally to features whose amalgamation in a single logic has proved elusive in the past. These features include hypothetical and committed updates, dynamic constraints on transaction execution, non-determinism, and bulk updates. Finally, Transaction Logic holds promise as a logical model of hitherto non-logical phenomena, including so-called procedural knowledge in AI, and the behavior of object-oriented databases, especially methods with side effects. This paper presents the...
Reliability Analysis of an Interconnection Network.

The Gamma Network.
The focused gamma network is proposed as one of the possible  implementations of the gamma neural model. The focused gamma  network is compared with the focused backpropagation network and  TDNN for a time series prediction problem, and with ADALINE in  a system identification problem.  1 
Minimal%2DCost Brother Trees.

LAURA A Formal Data Model and her Logical Design Methodology.

Detection of Mutual Inconsistency in Distributed Systems.

A Distributed File System Architecture Supporting High Availability.

Assumptions in Relational Database Theory.

Reflections on Boyce%2DCodd Normal Form.

Analysis of a General Mass Storage System.

Detection of Mutual Inconsitency in Distributed Systems.

Properties of acyclic database schemes an analysis.

Distributed Travelling Salesman Algorithms for Distributed Database Operation.

An Equivalence Between Relational Database Dependencies and a Fragment of Propositional Logic.

Distributed Travelling Salesman Algorithms for Distributed Database Operation.

Inferences Involving Embedded Multivalued Dependencies and Transitive Dependencies.

Notes on Shuffel%2FExchange%2DType Switching Networks.


Conditions for Optimality of the Huffman Algorithm.

Algorithmic Applications for a new Result on Multivalued Dependencies.


Analysis of Rounding Methods in Floating%2DPoint Arithmetic.

